Using Symbolic Computation in Buckling Analysis
نویسندگان
چکیده
منابع مشابه
Using Symbolic Computation in Buckling Analysis
Asymptotic buckling analysis of elastic structures can be considered a well established procedure (Budiansky, 1974) . It consists in bifurcation analysis of a system of oneparameter differential equations: balance, compatibility and constitutive equations . The aim of this work was to experiment with the use of automatic symbolic computation in the asymptotic bifurcation analysis of elastic bea...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملCheap Computation of Optimal Reduced Models Using Symbolic Computation
Many methods have been proposed for the reduction of single-variable and multi-variable systems having ordinary denominators and those having delays in their numerators and denominators. In this paper, an algorithm for this purpose is proposed that can be easily used by anybody with not too advanced knowledge of mathematics yielding optimal reduced models. This algorithm makes use of the symbol...
متن کاملSymbolic Loop Bound Computation for WCET Analysis
We present an automatic method for computing tight upper bounds on the iteration number of special classes of program loops. These upper bounds are further used in the WCET analysis of programs. To do so, we refine program flows using SMT reasoning and rewrite multi-path loops into single-path ones. Single-path loops are further translated into a set of recurrence relations over program variabl...
متن کاملSymbolic Computation of Derivations Using Labeled Trees
This paper discusses the effective symbolic computation of operators under composition. Examples include differential operators under composition and vector fields under the Lie bracket. Such operators in general do not commute, but are often rewritten in terms of other operators which do commute. If the original expression enjoys a certain symmetry, then naive rewriting requires the computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1985
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(85)80039-0